منابع مشابه
Introducing exogenous priority rules for the capacitated passenger assignment problem
We propose a novel algorithm for the capacitated passenger assignment problem in public transportation where priority lists define the order in which passengers are assigned. The originality of our approach is to define the priority rules exogenously. Separating explicitly theses rules from the assignment procedure allows for a great deal of flexibility to model various priority rules. Computat...
متن کاملAn Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach
One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...
متن کاملA Dynamic Priority Assignment Technique for Streamswith
The problem of scheduling multiple streams of real-time customers is addressed in this paper. The paper rst introduces the notion of (m; k)-rm deadlines to better characterize the timing constraints of real-time streams. More speciically, a stream is said to have (m; k)-rm deadlines if at least m out of any k consecutive customers must meet their deadlines. A stream with (m; k)-rm deadlines exp...
متن کاملPriority driven channel pin assignment
We present a polynomial time improvement of the linear channel pin assignment LCPA algorithms presented by Cai and Wong in 1990. We solve the LCPA problem according to minimum channel density under a special priority schedule subject to vertical constraints and ux. The priority driven linear channel pin assignment algorithm (PDCPA) reduces the channel height by an average of 17 % without increa...
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2016
ISSN: 0307-904X
DOI: 10.1016/j.apm.2016.03.038